package LineCode.剑指Offer.代码的鲁棒性;

import static LineCode.剑指Offer.Utils.TreeNodeUtil.*;

import LineCode.剑指Offer.Utils.TreeNodeUtil;
import LineCode.剑指Offer.dto.TreeNode;

import java.util.ArrayList;
import java.util.List;


/**
 * 输入两棵二叉树A，B，判断B是不是A的子结构。（ps：我们约定空树不是任意一个树的子结构）
 */
public class 树的子结构 {

    public static void main(String[] args) {
        TreeNode test1 = getOneTest1();
        printListTreeNode(getPreOrderRec(new ArrayList<TreeNode>(), test1));
        printListTreeNode(getInOrderRec(new ArrayList<TreeNode>(), test1));
        printListTreeNode(getPostOrderRec(new ArrayList<TreeNode>(), test1));

    }

    public boolean HasSubtree(TreeNode root1,TreeNode root2) {
        if (root1 == null || root2 == null) return false;
        return isSubtree(root1, root2)
                || HasSubtree(root1.left, root2)
                || HasSubtree(root1.right, root2);
    }

    public boolean isSubtree(TreeNode root1, TreeNode root2) {
        if (root2 == null) return true;
        if (root1 == null) return false;
        if (root1.val == root2.val)
            return isSubtree(root1.left, root2.left) &&
                    isSubtree(root1.right, root2.right);
        else return false;
    }
}
